翻訳と辞書 Words near each other ・ Indies Choice Book Awards ・ Indies Empire style ・ Indies Monument ・ Indies Records ・ Indies Under Fire ・ Indieszero ・ Indietracks ・ IndieVest ・ IndieWeb ・ IndieWebCamp ・ Indiewire ・ Indiewood ・ Indifference ・ Indifference (The Walking Dead) ・ Indifference curve ・ Indifference graph ・ Indifference price ・ Indifferent act ・ Indifferent eel ・ Indifferentism ・ Indifferenze ・ Indiga ・ Indiga River ・ Indigen ・ Indigenat (disambiguation) ・ Indigenat (Hungary) ・ Indigenisation and Economic Empowerment Act ・ Indigenism ・ Indigenismo ・ Indigenismo in Mexico Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Indifference graph ： ウィキペディア英語版 Indifference graph In graph theory, a branch of mathematics, an indifference graph is an undirected graph constructed by assigning a real number to each vertex and connecting two vertices by an edge when their numbers are within one unit of each other.〔.〕 Indifference graphs are also the intersection graphs of sets of unit intervals, or of properly nested intervals (intervals none of which contains any other one). Based on these two types of interval representations, these graphs are also called unit interval graphs or proper interval graphs; they form a subclass of the interval graphs. ==Equivalent characterizations== The finite indifference graphs may be equivalently characterized as *The intersection graphs of unit intervals,〔 *The intersection graphs of sets of intervals no two of which are nested (one containing the other),〔〔.〕 *The claw-free interval graphs,〔〔 *The graphs that do not have an induced subgraph isomorphic to a claw ''K''1,3, net (a triangle with a degree-one vertex adjacent to each of the triangle vertices), sun (a triangle surrounded by three other triangles that each share one edge with the central triangle), or hole (cycle of length four or more),〔. As cited by .〕 *The incomparability graphs of semiorders,〔 *The undirected graphs that have a linear order such that, for every three-vertex path $uvw$ whose vertices are ordered $u$–$v$–$w$, the path endpoints $u$ and $w$ are adjacent,〔.〕 *The graphs with no astral triple, three vertices connected pairwise by paths that avoid the third vertex and also do not contain two consecutive neighbors of the third vertex,〔.〕 *The graphs in which each connected component contains a path in which each clique of the component forms a contiguous sub-path,〔.〕 *The graphs whose vertices can be numbered in such a way that every shortest path forms a monotonic sequence,〔 and *The graphs whose adjacency matrices can be ordered such that, in each row and each column, the nonzeros of the matrix form a contiguous interval adjacent to the main diagonal of the matrix.〔.〕 For infinite graphs, some of these definitions may differ. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Indifference graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.